A language-independent method for the extraction of RDF verbalization templates
نویسندگان
چکیده
With the rise of the Semantic Web more and more data become available encoded using the Semantic Web standard RDF. RDF is faced towards machines: designed to be easily processable by machines it is difficult to be understood by casual users. Transforming RDF data into human-comprehensible text would facilitate non-experts to assess this information. In this paper we present a languageindependent method for extracting RDF verbalization templates from a parallel corpus of text and data. Our method is based on distant-supervised simultaneous multi-relation learning and frequent maximal subgraph pattern mining. We demonstrate the feasibility of our method on a parallel corpus of Wikipedia articles and DBpedia data for English and German.
منابع مشابه
Development of a Controlled Natural Language Interface for Semantic MediaWiki
Semantic wikis support the collaborative creation, editing and utilization of semantically-enriched content, and they may therefore be well-suited to addressing problems associated with the limited availability of high-quality online semantic content. Unfortunately, however, many popular semantic wikis, such as Semantic MediaWiki (SMW), are not sufficiently expressive to support full-scale onto...
متن کاملQuery Templates for RDF Stream Processing
In recent years there has been a growing interest in using Semantic Web technologies to process streaming information, and several RDF Stream Processing (RSP) systems have been developed to bridge the gap between static and streaming Linked Data. However, the lack of a standardized query language makes testing and benchmarking of systems difficult, since queries need to be developed for each su...
متن کاملOn the outer independent 2-rainbow domination number of Cartesian products of paths and cycles
Let G be a graph. A 2-rainbow dominating function (or 2-RDF) of G is a function f from V(G) to the set of all subsets of the set {1,2} such that for a vertex v ∈ V (G) with f(v) = ∅, thecondition $bigcup_{uin N_{G}(v)}f(u)={1,2}$ is fulfilled, wher NG(v) is the open neighborhoodof v. The weight of 2-RDF f of G is the value$omega (f):=sum _{vin V(G)}|f(v)|$. The 2-rainbowd...
متن کاملA German Verbalization Template for ORM conceptual models and rules
In the above-mentioned article we describe a novel approach to support multilingual verbalization of logical theories, axiomatizations, and other specifications such as business rules. This engineering solution is demonstrated with the Object Role Modeling language, although its underlying principles can be reused with other conceptual models and formal languages, such as Description Logics, to...
متن کاملA Lithuanian Verbalization Template for ORM conceptual models and rules
In the above-mentioned article we describe a novel approach to support multilingual verbalization of logical theories, axiomatizations, and other specifications such as business rules. This engineering solution is demonstrated with the Object Role Modeling language, although its underlying principles can be reused with other conceptual models and formal languages, such as Description Logics, to...
متن کامل